Binary heap

Results: 113



#Item
31Oblivious Data Structures∗ Xiao Shaun Wang1 , Kartik Nayak1 , Chang Liu1 , T-H. Hubert Chan2 , Elaine Shi1 , Emil Stefanov3 , and Yan Huang4 1  UMD

Oblivious Data Structures∗ Xiao Shaun Wang1 , Kartik Nayak1 , Chang Liu1 , T-H. Hubert Chan2 , Elaine Shi1 , Emil Stefanov3 , and Yan Huang4 1 UMD

Add to Reading List

Source URL: i.cs.hku.hk

Language: English - Date: 2014-10-29 22:55:19
32Integer data structures Advanced Algorithms – COMS31900Lecture 6 Van Emde Boas trees

Integer data structures Advanced Algorithms – COMS31900Lecture 6 Van Emde Boas trees

Add to Reading List

Source URL: www.cs.bris.ac.uk

Language: English - Date: 2014-03-11 09:18:19
33Advanced Algorithms – COMS31900Lecture 6 Van Emde Boas trees Markus Jalsenius

Advanced Algorithms – COMS31900Lecture 6 Van Emde Boas trees Markus Jalsenius

Add to Reading List

Source URL: www.cs.bris.ac.uk

Language: English - Date: 2014-03-11 09:18:19
34Automatic Fine-Grain Locking using Shape Properties Guy Golan-Gueta Nathan Bronson  Alex Aiken

Automatic Fine-Grain Locking using Shape Properties Guy Golan-Gueta Nathan Bronson Alex Aiken

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2011-08-21 21:41:00
35HEAPS II • Implementation • HeapSort • Bottom-Up Heap Construction • Locators

HEAPS II • Implementation • HeapSort • Bottom-Up Heap Construction • Locators

Add to Reading List

Source URL: crypto.cs.mcgill.ca

Language: English - Date: 2004-03-22 20:59:20
36Expected-Case Complexity of Approximate Nearest Neighbor Searching ∗ Sunil Arya† Ho-Yam Addy Fu†

Expected-Case Complexity of Approximate Nearest Neighbor Searching ∗ Sunil Arya† Ho-Yam Addy Fu†

Add to Reading List

Source URL: www.cse.ust.hk

Language: English - Date: 2006-03-31 23:24:24
37New Algorithms for Position Heaps Travis Gagie, Wing-Kai Hon, Tsung-Han Ku CPM2013  1

New Algorithms for Position Heaps Travis Gagie, Wing-Kai Hon, Tsung-Han Ku CPM2013 1

Add to Reading List

Source URL: www.cs.ucr.edu

Language: English - Date: 2013-07-14 14:44:58
38Algorithms  Lecture 17: Disjoint Sets [Fa’13] E pluribus unum (Out of many, one) — Official motto of the United States of America

Algorithms Lecture 17: Disjoint Sets [Fa’13] E pluribus unum (Out of many, one) — Official motto of the United States of America

Add to Reading List

Source URL: web.engr.illinois.edu

Language: English - Date: 2014-12-28 09:02:45
39Chapter 5 Comparing trees This chapter describes the tree comparison measures available in COMPONENT, and the various ways you can compare trees using the program. Among the possible uses of tree comparison measures are:

Chapter 5 Comparing trees This chapter describes the tree comparison measures available in COMPONENT, and the various ways you can compare trees using the program. Among the possible uses of tree comparison measures are:

Add to Reading List

Source URL: taxonomy.zoology.gla.ac.uk

Language: English - Date: 2007-07-24 12:38:38
40CS109A Notes for LecturePriority Queues 1. Model = set with priorities associated with elements. Priorities are comparable by a < operator, e.g., priorities could be real numbers. 2. Operations:

CS109A Notes for LecturePriority Queues 1. Model = set with priorities associated with elements. Priorities are comparable by a < operator, e.g., priorities could be real numbers. 2. Operations:

Add to Reading List

Source URL: infolab.stanford.edu

Language: English - Date: 2008-09-19 00:58:12